Markovian assignment decision process
نویسندگان
چکیده
— A finite-state, discrete-time Markovian décision process, in which, each action in each state is a feasible solution to a state dependent assignment problème is considered, The objective is to maximize the additive rewards realized by the assignments over an infinité time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain respectively, are maximized. Properties of optimal solutions in the two cases are characterized andfinite algorithms are presented.
منابع مشابه
Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
For a system of nite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between di erent service facilities are negligible, that each server can only work on one job at a time, and that several servers can work together on one job. We show that when the service rates depend...
متن کاملAn Analysis of Direct Reinforcement Learning in Non-Markovian Domains
It is well known that for Markov decision processes, the policies stable under policy iteration and the standard reinforcement learning methods are exactly the optimal policies. In this paper, we investigate the conditions for policy stability in the more general situation when the Markov property cannot be assumed. We show that for a general class of non-Markov decision processes, if actual re...
متن کاملMaximizing throughput in finite-source parallel queue systems
Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogenous, we demonstrate that the Shortest Qu...
متن کاملA Partially Observable Markovian Maintenance Process with Continuous Cost Functions
In this paper a two-state Markovian maintenance process where the true state is unknown will be considered. The operating cost per period is a continuous random variable which depends on the state of the process. If investigation cost is incurred at the beginning of any period, the system wit I be returned to the "in-control" state instantaneously. This problem is solved using the average crite...
متن کاملDecision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic planning, where many desirable behaviours are more naturally expressed as properties of execution sequences rather than as properties of states, NMRDPs form a more natural model than the commonly adopted fully Markovi...
متن کامل